Runtime analysis of the 1-ANT ant colony optimizer

An Ant Colony Optimization Algorithm for Network Vulnerability Analysis

Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...

1 Parallel Ant Colony Algorithms

Ant colony algorithms are computational methods for solving problems that are inspired by the behaviour of real ant colonies. One particularly interesting aspect of the behaviour of ant colonies is that relatively simple individuals perform complicated tasks. Examples for such collective behavior are: i) the foraging behaviour that guides ants on short paths to their food sources, ii) the colle...

MC-ANT: A Multi-Colony Ant Algorithm

In this paper we propose an ant colony optimization variant where several independent colonies try to simultaneously solve the same problem. The approach includes a migration mechanism that ensures the exchange of information between colonies and a mutation operator that aims to adjust the parameter settings during the optimization. The proposed method was applied to several benchmark instances...

The Ant Colony Optimization

Ant Colony Algorithm for the Single Loop Routing Problem

In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...